Fast swept-volume distance for robust collision detection
نویسنده
چکیده
The need for collision detection arises in several robotics areas, including motion-planning, online collision avoidance, and simulation. At the heart of most current methods are algorithms for interference detection andor distance computation. A few recent algorithms and implementations are very fast, but to use them for accurate collision detection, very small step sizes can be necessary, reducing their effective efficiency. We present a fast, implemented technique for doing exact distance computation and interference detection for translationally-swept bodies. For rotationally swept bodies, we adapt this technique to improve accuracy, for any given step size, in distance computation and interference detection. We present preliminary experiments that show that the combination of basic and swept-body calculations holds much promise for faster accurate collision detection.
منابع مشابه
Fast Proximity Queries with Swept Sphere Volumes
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some o set. The set of core primitive shapes includes a point, line, and rectangle. Thi...
متن کاملProximity Queries with Swept Sphere Volumes
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some ooset. The set of core primitive shapes includes a point, line, and rectangle. Thi...
متن کاملA Safe Swept Volume Method for Collision Detection Andre
This paper presents a collision detection method based on a swept volume approach. The proposed method computes a convex approximation (CSV) guaranteed to encompass the real swept volume (RSV). It is shown to be robust, which means that small errors in the model result in small errors in the result. It is first shown to be safe, which means that detections can ever be missed. It is then shown t...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملInteractive and Continuous Collision Detection for Avatars in Virtual Environments http://gamma.cs.unc.edu/Avatar
We present a fast algorithm for continuous collision detection between a moving avatar and its surrounding virtual environment. We model the avatar as an articulated body using line-skeletons with constant offsets and the virtual environment as a collection of polygonized objects. Given the position and orientation of the avatar at discrete time steps, we use an arbitrary in-between motion to i...
متن کامل